Probabilistic Safety Analysis of Sensor-Driven Hybrid Automata
نویسندگان
چکیده
The control programs of complex autonomous systems that have conditional branching can be modeled as linear hybrid systems. When the state knowledge is perfect, linear hybrid systems with statebased transition conditions can be verified against a specified unsafe set using existing model checking software. This paper introduces a formal method for calculating the failure probability due to state estimation uncertainty of these sensor-driven hybrid systems. Problem complexity is described and some reduction techniques for the failure probability calculation are given. An example goal-based control program is given and the failure probability for that system is calculated.
منابع مشابه
Verification and Power Analysis of an Event-Based System (TinyOS) and Sensor Network with Hybrid Automata
The advances in digital circuitry and sensor technology has enabled reliable monitoring of environments through wireless microsensor systems. Event-driven operating system has been shown to meet the requirements of such platforms. In this paper, we focus on TinyOS, an eventbased operating system for Smart Dust networked sensors. We show how to model TinyOS as a hybrid automata with the tool HyT...
متن کاملStochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
The analysis of hybrid systems exhibiting probabilistic behaviour is notoriously difficult. To enable mechanised analysis of such systems, we extend the reasoning power of arithmetic satisfiability-modulo-theory solving (SMT) by a comprehensive treatment of randomized (a.k.a. stochastic) quantification over discrete variables within the mixed Boolean-arithmetic constraint system. This provides ...
متن کاملEngineering constraint solvers for automatic analysis of probabilistic hybrid automata
In this article, we recall different approaches to the constraint-based, symbolic analysis of hybrid discrete-continuous systems and combine them to a technology able to address hybrid systems exhibiting both non-deterministic and probabilistic behavior akin to infinite-state Markov decision processes. To enable mechanized analysis of such systems, we extend the reasoning power of arithmetic sa...
متن کاملStochastic satisfiability modulo theories: a symbolic technique for the analysis of probabilistic hybrid systems
In today’s high-tech world, embedded computer systems interacting with technical, physical, or even biological environments are our permanent companions. While several of these applications are almost free of risk and just contribute to a better quality of life such as the use of cellular phones, washing machines, and refrigerators, other embedded systems operate in a safety-critical context wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008